; Fix last change

* doc/lispref/sequences.texi (Sequence Functions): Improve
indexing of last change

diff --git a/doc/lispref/sequences.texi b/doc/lispref/sequences.texi
index 654019dfc31592e6b24de14512755a38ddded213..896dac35c8e745abb1efc68e50640ddb5c587be5 100644 (file)
--- a/doc/lispref/sequences.texi
+++ b/doc/lispref/sequences.texi
@@ -446,6 +446,8 @@ element into a function of its own, you can use the following sorting
 function, which guarantees that the key will be computed for each list
 element exactly once.
 
+@cindex decorate-sort-undecorate
+@cindex Schwartzian transform
 @defun sort-on sequence predicate accessor
 This function stably sorts the list @var{sequence}, comparing the sort
 keys of the elements using @var{predicate}.  The comparison function